On two questions about feasibly constructive arithmetic
نویسندگان
چکیده
منابع مشابه
On two questions about feasibly constructive arithmetic
IPV is the intuitionistic theory axiomatized by Cook’s equational theory PV plus PIND on NP -formulas. Two extensions of IPV were introduced by Buss and by Cook and Urquhart by adding PIND for formulas of the form A(x) ∨ B, respectively ¬¬A(x), where A(x) is NP and x is not free in B. Cook and Urquhart posed the question of whether these extensions are proper. We show that in each of the two ca...
متن کاملOn two questions about circular choosability
We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a graph for which the infimum in the definition of the circular list chromatic number is not attained.
متن کاملA Feasibly Constructive Lower Bound for Resolution Proofs
Haken [4] first proved the intractability of resolution by showing that a family of propositional formulas encoding the pigeon-hole principle require superpolynomial-sized resolution proofs. Later, several authors [6,1,2] extended Haken’s techniques to obtain exponential lower bounds on the size of resolution proofs. All of these results are based on the counting method used by Haken and later ...
متن کاملOn two questions about restricted sumsets in finite abelian groups
Let G be an abelian group of finite order n, and let h be a positive integer. A subset A of G is called weakly h-incomplete if not every element of G can be written as the sum of h distinct elements of A; in particular, if A does not contain h distinct elements that add to zero, then A is called weakly h-zero-sum-free. We investigate the maximum size of weakly hincomplete and weakly h-zero-sum-...
متن کاملTwo Questions about Data-Oriented Parsing
In this paper I present ongoing work on the data-oriented parsing (DOP) model. In previous work, DOP was tested on a cleaned-up set of analyzed part-of-speech strings from the Penn Treebank, achieving excellent test results. This left, however, two important questions unanswered: (1) how does DOP perform if tested on unedited data, and (2) how can DOP be used for parsing word strings that conta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MLQ
سال: 2003
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.200310045